Implementation of subset-equational programs
نویسندگان
چکیده
منابع مشابه
Subset Logic Programs and Their Implementation
This paper discusses the design and implementation of a set-oriented logic programming paradigm, called subset-logic programming. Subset-logic programs are built up of three kinds of program clauses: subset, equational, and relational clauses. Using these clauses, we can program solutions to a broad range of problems of interest in logic programming and deductive databases. In previous research...
متن کاملInductive Synthesis of Equational Programs
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the given domain rules. To synthesize such programs, induction is necessary. We propose heuristics for generalizing from a sequence of deductive consequences. These are combined with rewrite-based methods of inductive proof...
متن کاملSubset-Equational Programming in Intelligent Decision Systems
Subset-equational programming is a paradigm of programming with subset and equality assertions. The underlying computational model is based on innermost reduction of expressions and restricted associative-commutative (a-c) matching for iteration over set-valued terms, where is the a-c constructor. Subset assertions incorporate a `collect-all' capability, so that the diierent subset assertions m...
متن کاملProving operational termination of membership equational programs
Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for advanced features such as evaluation strategies, rewriting modulo, use of extra variables in conditions, partiality, and expressive type systems (possibly including polymorphism and higher-order). However, many of those features...
متن کاملImplementation of Subset Logic
Subset-logic programs are built up of three kinds of program clauses: subset, equational, and relational clauses. Using these clauses, we can program solutions to a broad range of problems of interest in logic programming and deductive databases. In an earlier paper Jay92], we discussed the implementation of subset and equational program clauses. This paper substantially extends that work, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1992
ISSN: 0743-1066
DOI: 10.1016/0743-1066(92)90005-n